New symmetric decorrelating set-membership NLMS adaptive algorithms for blind speech intelligibility enhancement
نویسندگان
چکیده
منابع مشابه
Noisy Speech Intelligibility Enhancement
This paper addresses the study of the speech intelligibility enhancement. The speech model, noise sources, perceptual aspects of speech, and performance evaluation are reviewed. The intelligibility enhancement system based on spectral subtraction technique is investigated. Spectral density estimation device based on the algorithm of smoothed periodograms is analysed. Determination of the silenc...
متن کاملBlind Adaptive Interference Suppression Based on Set-Membership Constrained Constant-Modulus Algorithms with Time-Varying Bounds
This work presents blind constrained constant modulus (CCM) adaptive algorithms based on the set-membership filtering (SMF) concept and incorporates dynamic bounds for interference suppression applications. We develop stochastic gradient and recursive least squares type algorithms based on the CCM design criterion in accordance with the specifications of the SMF concept. We also propose a blind...
متن کاملSet - Membership Adaptive Equalization
This paper considers the problems of channel estimation and adaptive equalization in the novel framework of set-membership parameter estimation. Channel estimation using a class of set-membership identiication algorithms known as optimal bounding ellipsoid (OBE) algorithms and their extension to track time-varying channels are described. Simulation results show that the OBE channel estimators o...
متن کاملRephrasing-based speech intelligibility enhancement
Existing algorithms for improving speech intelligibility in a noisy environment generally focus on modifying the acoustic features of live, recorded or synthesized speech while preserving the phonetic composition (the message). In this paper, we present an algorithm for text-to-speech systems that operates at a higher level of abstraction, the message-level. We use a paraphrasing system to adju...
متن کاملStudy of Set-Membership Kernel Adaptive Algorithms and Applications
Adaptive algorithms based on kernel structures have been a topic of significant research over the past few years. The main advantage is that they form a family of universal approximators, offering an elegant solution to problems with nonlinearities. Nevertheless these methods deal with kernel expansions, creating a growing structure also known as dictionary, whose size depends on the number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SN Applied Sciences
سال: 2019
ISSN: 2523-3963,2523-3971
DOI: 10.1007/s42452-019-1641-7